Search results for "Deterministic encryption"

showing 1 items of 1 documents

Security of public key cryptosystems based on Chebyshev Polynomials

2004

Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptography. Moreover, they satisfy a semi-group property, which makes possible implementing a trapdoor mechanism. In this paper we study a public key cryptosystem based on such polynomials, which provides both encryption and digital signature. The cryptosystem works on real numbers and is quite efficient. Unfortunately, from our analysis it comes up that it is not secure. We describe an attack which permits to recover the corresponding plaintext from a given ciphertext. The same attack can be applied to produce forgeries …

FOS: Computer and information sciencesPlaintext-aware encryptionTheoretical computer scienceComputer Science - Cryptography and SecurityCramer–Shoup cryptosystemData_CODINGANDINFORMATIONTHEORYDeterministic encryptionHybrid cryptosystemCryptosystemElectrical and Electronic EngineeringSemantic securityThreshold cryptosystemCryptography and Security (cs.CR)Goldwasser–Micali cryptosystemMathematics
researchProduct